Conditional Equational Theories and Complete Sets of Transformations
نویسنده
چکیده
The idea to combine the advantages of function and logic programming has attracted many researches. Their work ranges from the integration of existing languages over higher-order logic to equational logic languages, where logic programs are augmented with equational theories. Recently, it has been proposed to handle those equational theories by complete sets of transformations. These transformations are extensions of the rules introduced by Herbrand and later used by Martelli and Montanari to compute the most general uniier of two expressions. We generalize this idea to complete sets of transformations for arbitrary conditional equational theories, the largest class of equational theories that admit a least Herbrand model. The completeness proof is based on the observation that each refutation with respect to linear paramodulation and reeection can be modelled by the transformations. As certain conditions imposed on an equational theory restrict the search space generated by paramodulation and reeection we can easily reene our transformations { due to the completeness proof { if the conditional equational theory is ground connuent or canonical.
منابع مشابه
Combining Logic Programming and Equation Solving
Conditional equational theories can be built into logic programming using a generalized resolution rule which calls a universal uniication procedure. Such uniication procedures are often deened by sound and strongly complete sets of inference rules. In other words, to resolve upon two atoms requires to show-by means of the inference rules-that the corresponding arguments of the atoms are equal ...
متن کاملComplete Sets of Transformations for General E-Unification
This paper is concerned with E-unification in arbitrary equational theories. We extend the method of transformations on systems of terms, developed by Martelli-Montanari for standard unification, to Eunification by giving two sets of transformations, BT and T, which are proved to be sound and complete in the sense that a complete set of E-unifiers for any equational theory E can be enumerated b...
متن کاملUniication in the Union of Disjoint Equational Theories: Combining Decision Procedures Uniication in the Union of Disjoint Equational Theories: Combining Decision Procedures
Most of the work on the combination of uniication algorithms for the union of disjoint equational theories has been restricted to algorithms which compute nite complete sets of uniiers. Thus the developed combination methods usually cannot be used to combine decision procedures, i.e., algorithms which just decide solvability of uniication problems without computing uniiers. In this paper we des...
متن کاملConstrained narrowing for conditional equational theories modulo axioms
For an unconditional equational theory (Σ, E) whose oriented equations ~ E are confluent and terminating, narrowing provides an E-unification algorithm. This has been generalized by various authors in two directions: (i) by considering unconditional equational theories (Σ, E∪B) where the ~ E are confluent, terminating and coherent modulo axioms B, and (ii) by considering conditional equational ...
متن کاملSolving Goals in Equational Languages
Solving equations in equational Horn-clause theories is a programming paradigm that combines logic programming and functional programming in a clean manner. Languages like EQLOG, SLOG and RITE, express programs as conditional rewrite rules and goals as equations to be solved. Procedures for completion of conditional equational theories, in a manner akin to that of Knuth and Bendix for unconditi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 75 شماره
صفحات -
تاریخ انتشار 1990